Universal Cast-as-Intended Verifiability
نویسندگان
چکیده
In electronic voting, we say that a protocol has cast-asintended verifiability if the contents of each encrypted vote can be audited in order to ensure that they match the voter’s selections. It is traditionally thought that this verification can only be performed by the voter who casts the vote, since only she knows the content of her vote. In this work, we show that this is not the case: we present the first cast-asintended verification mechanism which is universally verifiable, i.e., the first protocol in which anyone (the voter herself or another party) can check that the contents of an encrypted vote match the voter’s selections. To achieve this goal, we assume the existence of a trusted registrar. We formally define universal cast-as-intended verifiability and we show that our protocol satisfies such property, while also satisfying ballot privacy. We give a general construction of the protocol and an efficient instantiation which is provably secure in the random oracle model. We also present a voting system which can be implemented on top of the voting protocol, which is intended to present a more intuitive process to the
منابع مشابه
How to Challenge and Cast Your e-Vote
An electronic voting protocol provides cast-as-intended verifiability if the voter can verify that her encrypted vote contains the voting options that she selected. There are some proposals of protocols with cast-as-intended verifiability in the literature, but all of them have drawbacks either in terms of usability or in terms of security. In this paper, we propose a new voting scheme with cas...
متن کاملNew Techniques for Electronic Voting
This paper presents a novel unifying framework for electronic voting in the universal composability model that includes a property which is new to universal composability but well-known to voting systems: universal verifiability. Additionally, we propose three new techniques for secure electronic voting and prove their security and universal verifiability in the universal composability framewor...
متن کاملBallot Casting Assurance
We propose that voting protocols be judged in part on ballot casting assurance, a property which complements universal verifiability. Some protocols already support ballot casting assurance, though the concept has not received adequate explicit emphasis. Ballot casting assurance captures two well known voting concepts – cast as intended, and recorded as cast – into one end-to-end property: Alic...
متن کامل(Universal) Unconditional Verifiability in E-Voting without Trusted Parties
In e-voting protocol design, cryptographers must balance usability and strong security guarantees, such as privacy and verifiability. In traditional e-voting protocols, privacy is often provided by a trusted authority that learns the votes and computes the tally. Some protocols replace the trusted authority by a set of authorities, and privacy is guaranteed if less than a threshold number of au...
متن کاملReceipt-Free Homomorphic Elections and Write-in Ballots
Abstract. We present a voting protocol that protects voters’ privacy and achieves universal verifiability, receipt-freeness, and uncoercibility without ad hoc physical assumptions or procedural constraints (such as untappable channels, voting booths, smart cards, third-party randomizers, and so on). We discuss under which conditions the scheme allows voters to cast write-in ballots, and we show...
متن کامل